package a10_动态规划;

/**
 * <p>
 * a21_组合总和4复习4
 * </p>
 *
 * @author flyduck
 * @since 2025/4/15
 */
public class a21_组合总和4复习4 {
    public int combinationSum4(int[] nums, int target) {
        int[] dp = new int[target+1];
        dp[0] = 1;
        for (int j = 0; j <= target; j++) {
            for (int i = 0; i < nums.length; i++) {
                if(j >= nums[i]){
                    dp[j] = dp[j] + dp[j - nums[i]];
                }
            }
        }
        return dp[target];
    }
}
